On Arbitrary Selection Strategies for Basic Superposition
نویسندگان
چکیده
For first-order Horn clauses without equality, resolution is complete with an arbitrary selection of a single literal in each clause [dN 96]. Here we extend this result to the case of clauses with equality for superposition-based inference systems. Our result is a generalization of the result given in [BG 01]. We answer their question about the completeness of a superposition-based system for general clauses with an arbitrary selection strategy, provided there exists a refutation without applications of the factoring inference rule.
منابع مشابه
Strict Basic Superposition and Chaining
The most efficient techniques that have been developed to date for equality handling in first-order theorem proving are based on superposition calculi. Superposition is a refinement of paramodulation in that various ordering constraints are imposed on inferences. For practical purposes, a key aspect of superposition is its compatibility with powerful simplification techniques. In this paper we ...
متن کاملStrict Basic Superposition and Chaining Authors' Addresses Publication Notes
The most e cient techniques that have been developed to date for equality handling in rst-order theorem proving are based on superposition calculi. Superposition is a re nement of paramodulation in that various ordering constraints are imposed on inferences. For practical purposes, a key aspect of superposition is its compatibility with powerful simpli cation techniques. In this paper we solve ...
متن کاملar X iv : g r - qc / 0 10 10 95 v 1 2 4 Ja n 20 01 Testing the Dirac equation ∗
The dynamical equations which are basic for the description of the dynamics of quantum felds in arbitrary space–time geometries, can be derived from the requirements of a unique deterministic evolution of the quantum fields, the superposition principle, a finite propagation speed, and probability conservation. We suggest and describe observations and experiments which are able to test the uniqu...
متن کاملHandling Equality in Logic Programming via Basic Folding
We introduce a new approach to handling equality in logic programs. The method is based on the transformation of equational logic programs into logic programs without equality using basic superposition and the basic folding. We prove soundness, completeness and the existence of terminating strategies. The e ciency of the method is demonstrated on examples. An implementation is brie y discussed....
متن کاملRegular Derivations in Basic Superposition on Constrained Clauses
We prove the completeness of the regular strategy of derivations for superposition-based calculi. The regular strategy was pioneered by Kanger in (Kan63), who proposed that all equality inferences take place before all other steps in the proof. We show that the strategy is complete with the redundancy notions of tautology elimination and subsumption. The implication of our result is the complet...
متن کامل